An iterative modular multiplication algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative modular multiplication algorithm without magnitude comparison - Electronics Letters

A fast iterative modular multiplication algorithm is proposed for modular exponentiation with a large modulus, such as the RSA cryptosystem. The limit on partial products is raised to become less than 2” instead of modulus N with n-bit length. The naturally generated carry signifies when the computed partial product is greater than or equal to 2”. and a subtraction is subsequently performed. No...

متن کامل

An RNS Montgomery Modular Multiplication Algorithm

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large and implementing the system on a ring of fairly simple processors, an effect corresponding to a redundant high-radix implementation is achieved. The alg...

متن کامل

An IWS Montgomery Modular Multiplication Algorithm

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large, and implementing the system on a ring of fairly simple processors, the carry-free nature of RNS arithmetic achieves an eeect corresponding to a redunda...

متن کامل

An Efficient Parallel CMM-CSD Modular Exponentiation Algorithm by Using a New Modified Modular Multiplication Algorithm

This paper presents a new modified Montgomery modular multiplication algorithm based on canonical signed-digit (CSD) representation, and sliding window method. In this modified Montgomery modular multiplication algorithm, signed-digit recoding technique is used in order to increase probability of the zero bits. Also sliding window method is used in order to reduce the multiplication steps consi...

متن کامل

An Optimized Montgomery Modular Multiplication Algorithm for Cryptography

Montgomery modular multiplication is one of the fundamental operations used in cryptographicalgorithms, such as RSA andElliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more numberof addition stages for large word length addition, where nis the size of of operandsoperands inbits. Inthis pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2002

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(02)00138-4